Problem of time - PDFSEARCH.IO - Document Search Engine

Problem of time
Results: 679

#	Item
181	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
182	Making Sense of Fragmentary Information: Compendium and the Intelligence Community E. Jeffrey Conklin, Ph.D.1 Contents 1. Add to Reading List Source URL: www.cognexus.org Language: English - Date: 2008-02-17 07:01:48 Wicked problem Intelligence analysis Collective intelligence Data collection Behavior Time Compendium Notetaking software Collaboration
183	Algorithms Lecture 0: Introduction [Sp’14] Hinc incipit algorismus. Haec algorismus ars praesens dicitur in qua Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:12 Analysis of algorithms Algorithm Mathematical logic Multiplication algorithm Time complexity Stable marriage problem Stability Euclidean algorithm CYK algorithm Theoretical computer science Mathematics Applied mathematics
184	16th Canadian Conference on Computational Geometry, 2004 An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Measure of the Union of Hyperrectangles in Dimensions Susumu Suzuki Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Operations research NP-complete problems Search algorithms Analysis of algorithms Boolean satisfiability problem Backtracking Algorithm PP Time complexity Theoretical computer science Applied mathematics Computational complexity theory
185	Real-time Spatial Task Assignment for Weather Crowdsourcing Hien To, Liyue Fan, Luan Tran, Cyrus Shahabi {hto, liyuefan, luantran, shahabi}@usc.edu University of Southern California Add to Reading List Source URL: imsc.usc.edu Language: English - Date: 2015-04-06 12:57:07 HM NP-complete problems Maximum coverage problem Crowdsourcing
186	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
187	Problem 1: Green’s Functions The one-particle time-ordered Green’s function of a many-body system is defined as Gαβ (t, x; t′ , x′ ) = −i ⟨T ψα (t, x)ψβ† (t′ , x′ )⟩ . (1) The particle density c Add to Reading List Source URL: www.nordita.org Language: English - Date: 2015-03-23 03:13:44 Graphene Schrödinger equation Electron Fermi gas Fermi surface Quasiparticle Electrical resistivity and conductivity Friedel oscillations Fermi energy Physics Condensed matter physics Free electron model
188	Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Applied mathematics Convex optimization Linear programming Constraint Candidate solution Algorithm Linear programming relaxation LP-type problem Mathematical optimization Operations research Mathematics
189	CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:03 Computational complexity theory Computational geometry Linear programming Analysis of algorithms LP-type problem Algorithm Time complexity Streaming algorithm Minimum bounding box algorithms Theoretical computer science Applied mathematics Mathematics
190	CHAPTER 12 MANAGING WRITING PROCESSES AND THE EMERGENT TEXT The guidance in this book has focused on the identification and crystallization of the communicative space—the textual version of the rhetorical situation— Add to Reading List Source URL: wac.colostate.edu Language: English - Date: 2013-08-17 15:52:32 Attention-deficit hyperactivity disorder Cognition Mental processes Neuropsychological assessment Problem solving Writing process Procrastination Creativity Time management Mind Cognitive science Psychology

UPDATE